Quantitative temporal logics over the reals: PSpace and below
نویسندگان
چکیده
منابع مشابه
Quantitative temporal logics over the reals: PSpace and below
In many cases, the addition of metric operators to qualitative temporal logics (TLs) increases the complexity of satisfiability by at least one exponential: while common qualitative TLs are complete for NP or PSpace, their metric extensions are often ExpSpace-complete or even undecidable. In this paper, we exhibit several metric extensions of qualitative TLs of the real line that are at most PS...
متن کاملOn the Satisfiability of Metric Temporal Logics over the Reals
We show that there is a satisfiability-preserving translation of QTL formulae interpreted over finitely variable behaviors into formulae of the CLTL-overclocks logic. The satisfiability of CLTL-over-clocks can be determined through a suitable encoding into the input logics of SMT solvers, so it constitutes an effective decision procedure for QTL. Although decision procedures for determining sat...
متن کاملTemporal Logics over Linear Time Domains Are in PSPACE
We investigate the complexity of the satisfiability problem of temporal logics with a finite set of modalities definable in the existential fragment of monadic second-order logic. We show that the problem is in pspace over the class of all linear orders. The same techniques show that the problem is in pspace over many interesting classes of linear orders.
متن کاملSynthesis for Temporal Logic over the Reals
We develop the notion of synthesizing, or constructing, a temporal structure over the real numbers flow of time, from a given temporal or first-order specification. We present a new notation for giving a manageable description of the compositional construction of such a model and an efficient procedure for finding it from the speci-
متن کاملUniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces
We study the complexity of temporal logics over concurrent systems that can be described by Mazurkiewicz traces. We develop a general method to prove that the uniform satisfiability problem of local temporal logics is in PSPACE. We also demonstrate that this method applies to all known local temporal logics.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2007
ISSN: 0890-5401
DOI: 10.1016/j.ic.2006.08.006